State-variable planning under structural restrictions: algorithms and complexity

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

State-Variable Planning Under Structural Restrictions: Algorithms and Complexity

Computationally tractable planning problems reported in the literature so far have almost exclusively been de ned by syntactical restrictions. To better exploit the inherent structure in problems, it is probably necessary to study also structural restrictions on the underlying state-transition graph. The exponential size of this graph, though, makes such restrictions costly to test. Hence, we p...

متن کامل

Complexity Results for State-variable Planning under Mixed Syntactical and Structural Restrictions

Most tractable planning problems reported in the literature have been deened by syntactical restrictions. To better exploit the inherent structure of problems, however, it is probably necessary to study also structural restrictions on the state-transition graph. We present an exhaustive map of complexity results for state-variable planning under all combinations of our previously analysed synta...

متن کامل

On the Complexity of Global Scheduling Constraints under Structural Restrictions

We investigate the computational complexity of two global constraints, CUMULATIVE and INTERDISTANCE. These are key constraints in modeling and solving scheduling problems. Enforcing domain consistency on both is NP-hard. However, restricted versions of these constraints are often sufficient in practice. Some examples include scheduling problems with a large number of similar tasks, or tasks spa...

متن کامل

The Complexity of Quantified Constraint Satisfaction Problems under Structural Restrictions

We give a clear picture of the tractability/intractability frontier for quantified constraint satisfaction problems (QCSPs) under structural restrictions. On the negative side, we prove that checking QCSP satisfiability remains PSPACE-hard for all known structural properties more general than bounded treewidth and for the incomparable hypergraph acyclicity. Moreover, if the domain is not fixed,...

متن کامل

Tractable Planning with State Variables by Exploiting Structural Restrictions

So far, tractable planning problems reported in the literature have been defined by syntactical restrictions. To better exploit the inherent structure in problems, however, it is probably necessary to study also structural restrictions on the state-transition graph. Such restrictions are typically computationally hard to test, though, since this graph is of exponential size. Hence, we take an i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Artificial Intelligence

سال: 1998

ISSN: 0004-3702

DOI: 10.1016/s0004-3702(98)00003-4